Let $A = \{x_1, x_2, x_3, \dots, x_7\}$ and $B = \{y_1, y_2, y_3\}$ be two sets containing seven and three distinct elements respectively. Then the total number of functions $f: A \to B$ which are onto,if there exist exactly three elements $x$ in $A$ such that $f(x) = y_2$,is equal to

  • A
    $14(^7C_2)$
  • B
    $16(^7C_3)$
  • C
    $12(^7C_2)$
  • D
    $14(^7C_3)$

Explore More

Similar Questions

If a set $A$ has $m$ elements and the set $B$ has $n$ elements,then the number of injections from $A$ to $B$ is

Let $A = \{1, 2, 3, \ldots, n\}$ and $B = \{a, b\}$. If the number of onto functions from $A$ to $B$ is $62$,then the number of subsets of $A$ containing exactly three elements is:

For $A = \{-1, -2, 3, 4\}$,the number of one-one functions from $A$ to $A$ is . . . . . . .

Show that $f: N \rightarrow N$,given by $f(x) = \begin{cases} x+1, & \text{if } x \text{ is odd} \\ x-1, & \text{if } x \text{ is even} \end{cases}$ is both one-one and onto.

If $f: R \rightarrow R$ is defined as $f(x)=x^2-2x-3$,then $f$ is

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo